On the defect theorem for trees
نویسندگان
چکیده
In this paper we extend the defect theorem from words to k-ary labeled trees. Indeed we prove that, if a set of n trees satisses a nontrivial identity, then these trees can be expressed as concatenation of at most n ? 1 trees. Some consequences in the theory of tree codes are derived.
منابع مشابه
Defect theorems for trees
We generalize di erent notions of a rank of a set of words to sets of trees. We prove that almost all of those ranks can be used to formulate a defect theorem. However, as we show, the pre x rank forms an exception. TUCS Research Group Mathematical Structures of Computer Science
متن کاملLimit distribution of the degrees in scaled attachment random recursive trees
We study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by Devroye et. al (2011). In a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor iX_i floor$ where $X_0$, $ldots$ , $X_n$ is a sequence of i.i.d. random variables, with support in [0,...
متن کاملSystems related to the FMathL vision
There are already many automatic mathematical assistants that provide expert help in specialized domains. Known classes include computer algebra systems, automated deduction systems, modeling systems, matrix packages, numerical prototyping languages, decision trees for scientific computing software, etc.. Such existing tools already provide partial functionality of the kind to be created in the...
متن کاملOn intermediate value theorem in ordered Banach spaces for noncompact and discontinuous mappings
In this paper, a vector version of the intermediate value theorem is established. The main theorem of this article can be considered as an improvement of the main results have been appeared in [textit{On fixed point theorems for monotone increasing vector valued mappings via scalarizing}, Positivity, 19 (2) (2015) 333-340] with containing the uniqueness, convergent of each iteration to the fixe...
متن کاملCodes and equations on trees
The objective of this paper is to study, by new formal methods, the notion of tree code introduced by M. Nivat in [23]. In particular we introduce the notion of stability for sets of trees closed under concatenation. This allows us to give a characterization of tree codes which is very close to the algebraic characterization of word codes in terms of free monoids. We further de ne the stable hu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996